Nash equilibria of network formation games under consent
نویسندگان
چکیده
We investigate the Nash equilibria of game theoretic models of network formation based on explicit consent in link formation. These so-called “consent models” explicitly take account of link formation costs. We provide characterizations of Nash equilibria of such consent models under both one-sided and two-sided costs of link formation. We relate these equilibrium concepts to link-based stability concepts, in particular strong link deletion proofness.
منابع مشابه
Partial Cooperative Equilibria: Existence and Characterization
We study the solution concepts of partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria. The partial cooperative Cournot-Nash equilibrium is axiomatically characterized by using notions of rationality, consistency and converse consistency with regard to reduced games. We also establish sufficient conditions for which partial cooperative Cournot-Nash equilibr...
متن کاملCostly network formation and regular equilibria
We prove that for generic network-formation games where players incur a strictly positive cost to propose links the number of Nash equilibria is finite. Furthermore all Nash equilibria are regular and, therefore, stable sets.
متن کاملDEPARTMENT OF ECONOMICS WORKING PAPER SERIES A Belief-based Approach to Network Formation
In this paper we consider four different game-theoretic approaches to describe the formation of social networks under mutual consent and costly communication. First, we consider Jackson-Wolinsky’s concept of pairwise stability. Next, we introduce a stronger version of this concept based on linking decisions by nodes, denoted as strict pairwise stability. Third, we consider Myerson’s consent gam...
متن کاملBounded Budget Betweenness Centrality Game for Strategic Network Formations
In computer networks and social networks, the betweenness centrality of a node measures the amount of information passing through the node when all pairs are conducting shortest path exchanges. In this paper, we introduce a strategic network formation game in which nodes build connections subject to a budget constraint in order to maximize their betweenness in the network. To reflect real world...
متن کاملGeneric determinacy of Nash equilibrium in network-formation games
This paper shows that the set of probability distributions over networks induced by Nash equilibria of the network formation game proposed by Myerson (1991) is finite for a generic assignment of payoffs to networks. The same result can be extended to several variations of the game found in the literature.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Social Sciences
دوره 64 شماره
صفحات -
تاریخ انتشار 2012